#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL d[maxn],cnt[maxn];
map<LL,LL>map1;
LL n;
bool check(){
    for(LL i=0;i<n+10;i++) cnt[i]=0;

    for(LL i=3;i<=n;i+=2){
        cnt[i/2]=d[i]-d[i-2];
    }
    LL sum=0;LL tem=0;
    for(LL i=1;i<n/2;i++){
        if(cnt[i]%(i*2)!=0) return false;
        if(cnt[i]==0) return false;
        tem+=cnt[i]/(i*2);
        sum+=tem;
    }
    if(d[1]&1) return false;
    LL t=d[1]/2-sum;
    if(t<=0) return false;
    if(t%(n/2)==0) return true;
    else return false;

}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    map1.clear();
    LL flag=1;
    cin>>n;
    n*=2;
    for(LL i=1;i<=n;i++) cin>>d[i];
    sort(d+1,d+1+n);
    for(LL i=1;i<=n;i++){
        map1[d[i]]++;
    }
    for(auto i:map1){
        if(i.second&1) flag=0;
    }
    if(flag==0){
        cout<<"NO"<<endl;
        continue;
    }
    if( check()==true ){
        cout<<"YES"<<endl;
    }
    else cout<<"NO"<<endl;
  }
return 0;
}
